Some Remarks on the Plotkin Bound

نویسنده

  • Jörn Quistorff
چکیده

In coding theory, Plotkin’s upper bound on the maximal cadinality of a code with minimum distance at least d is well known. He presented it for binary codes where Hamming and Lee metric coincide. After a brief discussion of the generalization to q-ary codes preserved with the Hamming metric, the application of the Plotkin bound to q-ary codes preserved with the Lee metric due to Wyner and Graham is improved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some remarks on autoequivalences of categories

Prof. Boris I. Plotkin [1, 2] drew attention to the question when an equivalence between two categories is isomorphic as a functor to an isomorphism between them. It turns out that it is quite important for universal algebraical geometry and concerns mainly the categories Θ0(X) of free universal algebras of some variety Θ free generated by finite subsets of X. In the paper, a complete answer to...

متن کامل

Remarks on Codes, Spectral Transforms, and Decision Diagrams

In this paper, we discuss definitions, features, and relationships of Reed-Muller transforms, Reed-Muller codes and their generalizations to multiple-valued cases, and Reed-Muller decision diagrams. The novelty in this primarily review paper resides in putting together these concepts in the same context and providing a uniform point of view to their definition in terms of a convolutionwise mult...

متن کامل

On Plotkin-Optimal Codes over Finite Frobenius Rings

We study the Plotkin bound for codes over a finite Frobenius ring R equipped with the homogeneous weight. We show that for codes meeting the Plotkin bound, the distribution on R induced by projection onto a coordinate has an interesting property. We present several constructions of codes meeting the Plotkin bound and of Plotkin-optimal codes. We also investigate the relationship between Butson-...

متن کامل

New bounds for codes over finite Frobenius rings

We give further results on the question of code optimality for linear codes over finite Frobenius rings for the homogeneous weight. This article improves on the existing Plotkin bound derived in an earlier paper [6], and suggests a version of a Singleton bound. We also present some families of codes meeting these new bounds.

متن کامل

Construction of Cyclic and Constacyclic Codes for b-symbol Read Channels Meeting the Plotkin-like Bound

The symbol-pair codes over finite fields have been raised for symbol-pair read channels and motivated by application of high-density data storage technologies [1, 2]. Their generalization is the code for b-symbol read channels (b > 2). Many MDS codes for b-symbol read channels have been constructed which meet the Singleton-like bound ([3, 4, 10] for b = 2 and [11] for b > 2). In this paper we s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 10  شماره 

صفحات  -

تاریخ انتشار 2003